Search results for "Minimum degree algorithm"
showing 2 items of 2 documents
Size-intensive decomposition of orbital energy denominators
2000
We introduce an alternative to Almlöf and Häser’s Laplace transform decomposition of orbital energy denominators used in obtaining reduced scaling algorithms in perturbation theory based methods. The new decomposition is based on the Cholesky decomposition of positive semidefinite matrices. We show that orbital denominators have a particular short and size-intensive Cholesky decomposition. The main advantage in using the Cholesky decomposition, besides the shorter expansion, is the systematic improvement of the results without the penalties encountered in the Laplace transform decomposition when changing the number of integration points in order to control the convergence. Applications will…
Method specific Cholesky decomposition : Coulomb and exchange energies
2008
We present a novel approach to the calculation of the Coulomb and exchange contributions to the total electronic energy in self consistent field and density functional theory. The numerical procedure is based on the Cholesky decomposition and involves decomposition of specific Hadamard product matrices that enter the energy expression. In this way, we determine an auxiliary basis and obtain a dramatic reduction in size as compared to the resolution of identity (RI) method. Although the auxiliary basis is determined from the energy expression, we have complete control of the errors in the gradient or Fock matrix. Another important advantage of this method specific Cholesky decomposition is t…